Random geometric graphs and isometries of normed spaces
نویسندگان
چکیده
منابع مشابه
Approximate Isometries on Finite-dimensional Normed Spaces
Every ε-isometry u between real normed spaces of the same finite dimension which maps the origin to the origin may by uniformly approximated to within 2ε by a linear isometry. Under a smoothness hypothesis, necessary and sufficient conditions are obtained for the same conclusion to hold for a given ε-isometry between infinite-dimensional Banach spaces.
متن کاملIsometries on Quasi–normed Cones and Bicompletion
We show that every quasi–norm p on a (real) cancellative cone X induces in a natural way an extended quasi–metric ep on X for which (X, ep) is an extended quasi–metric cone. We prove that the structure of a quasi– normed cone is preserved by bicompletion, under bijective isometries. In fact, we observe that isometries are not necessarily injective in this setting. Some illustrative examples are...
متن کاملInfinite Random Geometric Graphs
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملDynamic Random Geometric Graphs
We provide the first analytical results for the connectivity of dynamic random geometric graphs-a model of mobile wireless networks in which vertices move in random (and periodically updated) directions, and an edge exists between two vertices if their Euclidean distance is below a given threshold. We provide precise asymptotic results for the expected length of the connectivity and disconnecti...
متن کاملRandom geometric graphs.
We analyze graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient, which shows that the graphs are distinctly different from standard ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2018
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/7420